#include <iostream>
using namespace std;

/**
 * @description: 
 * @param {int} n: 当前走的步数和
 * @param {int} target：目标步数
 * @param {int} &count：几种方法
 * @optimazation: f(n)=2^(n-1)，不用递归
 */
void step(int n, int target, int &count)
{
    if (n == target)
    {
        count++;
        return;
    }
    if (n > target)
        return;

    for (int i = 1; i <= 6; i++)
    {
        step(n + i, target, count);
    }
}

int main()
{
    int count = 0;
    int target = 6;
    step(0, target, count);
    cout << count << endl;
    return 0;
}